#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qmi(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		return x; 
	}
	size_t operator () (uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
		return splitmix64(x + FIXED_RANDOM);
	}
};

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n + 2);
    vector<bool> vis(n + 1);
    for (int i = 1; i <= n; ++i) {vis[i] = false; cin >> a[i];}
    int ans = 0;
    for (int i = 1, l = 1, r = n; l < r; ++i) {
        while (vis[a[l]]) ++l;
        while (vis[a[r]]) --r;
        if (l >= r) break;
        if (a[l] != i || a[r] != n - i + 1) ans = i;
        vis[i] = vis[n - i + 1] = true; 
    }
    printf("%d\n", ans);
}

int main()
{
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}